On the largest prime factor of x2-1
نویسندگان
چکیده
In this paper, we find all integers x such that x − 1 has only prime factors smaller than 100. This gives some interesting numerical corollaries. For example, for any positive integer n we can find the largest positive integer x such that all prime factors of each of x, x + 1, . . . , x+ n are less than 100.
منابع مشابه
Products of Factorials in Smarandache Type Expressions
In [3] and [5] the authors ask how many primes are of the form xY + yX, where gcd (x, y) = 1 and x, y 2: 2. Moreover, Jose Castillo (see [2]) asks how many primes are of the Smarandache form xil + X2 X3 + ... + Xn Xl , where n > 1, Xl, X2, ••• , Xn > 1 and gcd (Xl, X2, ••• , X n ) = 1 (see [9]). In this article we announce a lower bound for the size of the largest prime divisor of an expression...
متن کاملEXPLICIT FACTORIZATION OF x 2 a p b r c − 1 OVER A FINITE FIELD
Let Fq be a finite field of odd order q. In this paper, the irreducible factorization of x2 pr − 1 over Fq is given in a very explicit form, where a, b, c are positive integers and p, r are odd prime divisors of q−1. It is shown that all the irreducible factors of x2 pr − 1 over Fq are either binomials or trinomials. In general, denote by vp(m) the degree of prime p in the standard decompositio...
متن کاملA Characterization of the Suzuki Groups by Order and the Largest Elements Order
One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let be a finite group. We denote by the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if is a group with an...
متن کاملOn the largest prime factor of the Mersenne numbers
Let P (k) be the largest prime factor of the positive integer k. In this paper, we prove that the series ∑ n≥1 (log n)α P (2n − 1) is convergent for each constant α < 1/2, which gives a more precise form of a result of C. L. Stewart of 1977.
متن کاملMonomial graphs and generalized quadrangles
Let Fq be a finite field, where q = p for some odd prime p and integer e ≥ 1. Let f, g ∈ Fq[x, y] be monomials. The monomial graph Gq(f, g) is a bipartite graph with vertex partition P ∪L, P = Fq = L, and (x1, x2, x3) ∈ P is adjacent to [y1, y2, y3] ∈ L if and only if x2 + y2 = f(x1, y1) and x3 + y3 = g(x1, y1). Dmytrenko, Lazebnik, and Williford proved in [6] that if p ≥ 5 and e = 23 for integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 80 شماره
صفحات -
تاریخ انتشار 2011